Forbidden Vertices
نویسندگان
چکیده
In this work, we introduce and study the forbidden-vertices problem. Given a polytope P and a subset X of its vertices, we study the complexity of linear optimization over the subset of vertices of P that are not contained in X . This problem is closely related to finding the k-best basic solutions to a linear problem. We show that the complexity of the problem changes significantly depending on the encoding of both P and X . We provide additional tractability results and extended formulations when P has binary vertices only. Some applications and extensions to integral polytopes are discussed.
منابع مشابه
Pairs of forbidden class of subgraphs concerning K1, 3 and P6 to have a cycle containing specified vertices
In [3], Faudree and Gould showed that if a 2-connected graph contains no K1,3 and P6 as an induced subgraph, then the graph is hamiltonian. In this paper, we consider the extension of this result to cycles passing through specified vertices. We define the families of graphs which are extension of the forbidden pair K1,3 and P6, and prove that the forbidden families implies the existence of cycl...
متن کاملGraph Sharing Game and the Structure of Weighted Graphs with a Forbidden Subdivision
The graph sharing game is played by two players, Alice and Bob, on a connected graph G with non-negative weights assigned to the vertices. Starting with Alice, the players take the vertices of G one by one, in each move keeping the set of all taken vertices connected, until the whole G has been taken. Each player wants to maximize the total weight of the vertices they have gathered. It is prove...
متن کاملForbidden subgraph characterization of bipartite unit probe interval graphs
A graph is a probe interval graph (PIG) if its vertices can be partitioned into probes and nonprobes with an interval assigned to each vertex so that vertices are adjacent if and only if their corresponding intervals intersect and at least one of the vertices is a probe. When all intervals have the same length (or equivalently, no interval contains another properly) the graph is a unit probe in...
متن کامل-tree probe interval graphs have a large obstruction set
Probe interval graphs are used as a generalization of interval graphs in physical mapping of DNA. is a probe interval graph (PIG) with respect to a partition of if vertices of correspond to intervals on a real line and two vertices are adjacent if and only if their corresponding intervals intersect and at least one of them is in ; vertices belonging to are called probes and vertices belonging t...
متن کامل2-Tree probe interval graphs have a large obstruction set
Probe interval graphs (PIGs) are used as a generalization of interval graphs in physical mapping of DNA.G= (V ,E) is a probe interval graph (PIG) with respect to a partition (P,N) ofV if vertices of G correspond to intervals on a real line and two vertices are adjacent if and only if their corresponding intervals intersect and at least one of them is in P; vertices belonging to P are called pro...
متن کاملAn Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions
A graph with forbidden transitions is a pair (G,FG) where G := (VG, EG) is a graph and FG is a subset of the set {({y, x}, {x, z}) ∈ E G}. A path in a graph with forbidden transitions (G,FG) is a path in G such that each pair ({y, x}, {x, z}) of consecutive edges does not belong to FG. It is shown in [S. Szeider, Finding paths in graphs avoiding forbidden transitions, DAM 126] that the problem ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Oper. Res.
دوره 40 شماره
صفحات -
تاریخ انتشار 2015